Construction of a (64, 237, 12) Code via Galois Rings
نویسندگان
چکیده
Certain nonlinear binary codes contain more codewords than any comparable linear code presently known. These include the Kerdock and Preparata codes, which exist for all lengths 4m ≥ 16. At length 16 they coincide to give the Nordstrom-Robinson code. This paper constructs a nonlinear (64, 237, 12) code as the binary image, under the Gray map, of an extended cyclic code defined over the integers modulo 4 using Galois rings. The Nordstrom-Robinson code is defined in this same way, and like the Nordstrom-Robinson code, the new code is better than any linear code that is presently known.
منابع مشابه
Authentication codes based on resilient Boolean maps
We introduce new constructions of systematic authentication codes over finite fields and Galois rings. One code is built over finite fields using resilient functions and it provides optimal impersonation and substitution probabilities. Other two proposed codes are defined over Galois rings, one is based on resilient maps and it attains optimal probabilities as well, while the other uses maps wh...
متن کاملEnumeration and construction of additive cyclic codes over Galois rings
Let R = GR(p, l) be a Galois ring of characteristic p and cardinality pεl, where p and l are prime integers. First, we give a canonical form decomposition for additive cyclic codes over R. This decomposition is used to construct additive cyclic codes and count the number of such codes, respectively. Thenwe give the trace dual code for each additive cyclic code over R from its canonical form dec...
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملProof of Correspondence between Keys and Encoding Maps in an Authentication Code
Systematic authentication codes without secrecy were defined in [1]. In [2] two new systematic authentication codes based on the Gray map on a Galois ring are introduced with the purpose of optimally reducing the impersonation and substitution probabilities. The first code is another example of a previously constructed code using the Gray map on Galois rings and modules over these rings [3,4]. ...
متن کاملConstruction of MDS self-dual codes over Galois rings
The purpose of this paper is to construct nontrivial MDS self-dual codes over Galois rings. We consider a building-up construction of self-dual codes over Galois rings as a GF(q)-analogue of [20]. We give a necessary and sufficient condition on which the building-up construction holds. We construct MDS self-dual codes of lengths up to 8 over GR(3, 2), GR(3, 2) and GR(3, 2), and near-MDS self-du...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 10 شماره
صفحات -
تاریخ انتشار 1997